0.04/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.13/0.16	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.16/0.37	% Computer   : n011.cluster.edu
0.16/0.37	% Model      : x86_64 x86_64
0.16/0.37	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.16/0.37	% Memory     : 8042.1875MB
0.16/0.37	% OS         : Linux 3.10.0-693.el7.x86_64
0.16/0.37	% CPULimit   : 1200
0.16/0.37	% WCLimit    : 120
0.16/0.37	% DateTime   : Tue Jul 13 11:23:40 EDT 2021
0.16/0.37	% CPUTime    : 
0.16/0.37	% Number of cores: 8
0.16/0.37	% Python version: Python 3.6.8
0.16/0.38	# Version: 2.6rc1-ho
0.16/0.39	# No SInE strategy applied
0.16/0.39	# Trying AutoSched0 for 59 seconds
0.22/0.54	# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S02DI
0.22/0.54	# and selection function PSelectAntiRROptimalLit.
0.22/0.54	#
0.22/0.54	# Preprocessing time       : 0.090 s
0.22/0.54	# Presaturation interreduction done
0.22/0.54	
0.22/0.54	# Proof found!
0.22/0.54	# SZS status Theorem
0.22/0.54	# SZS output start CNFRefutation
0.22/0.54	thf(fact_24_subset__iff, axiom, (ord_less_eq_set_val)=(^[X235:set_val, X236:set_val]:![X237:val]:(member_val @ X237 @ X235=>member_val @ X237 @ X236)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_24_subset__iff)).
0.22/0.54	thf(fact_0__092_060open_062_092_060And_062x_O_Ax_A_092_060in_062_Ascc_A_092_060Longrightarrow_062_Ax_A_092_060in_062_AP_092_060close_062, axiom, ![X2:val]:(member_val @ X2 @ scc=>member_val @ X2 @ p), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0__092_060open_062_092_060And_062x_O_Ax_A_092_060in_062_Ascc_A_092_060Longrightarrow_062_Ax_A_092_060in_062_AP_092_060close_062)).
0.22/0.54	thf(conj_0, conjecture, ord_less_eq_set_val @ scc @ p, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
0.22/0.54	thf(c_0_3, plain, ![X235:set_val, X236:set_val]:(ord_less_eq_set_val @ X235 @ X236<=>![X1889:val]:(member_val @ X1889 @ X235=>member_val @ X1889 @ X236)), inference(fof_simplification,[status(thm)],[fact_24_subset__iff])).
0.22/0.54	thf(c_0_4, plain, ![X3024:val]:(~member_val @ X3024 @ scc|member_val @ X3024 @ p), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0__092_060open_062_092_060And_062x_O_Ax_A_092_060in_062_Ascc_A_092_060Longrightarrow_062_Ax_A_092_060in_062_AP_092_060close_062])])).
0.22/0.54	thf(c_0_5, plain, ![X2235:set_val, X2236:set_val, X2237:val, X2238:set_val, X2239:set_val]:((~ord_less_eq_set_val @ X2235 @ X2236|(~member_val @ X2237 @ X2235|member_val @ X2237 @ X2236))&((member_val @ (esk50_2 @ X2238 @ X2239) @ X2238|ord_less_eq_set_val @ X2238 @ X2239)&(~member_val @ (esk50_2 @ X2238 @ X2239) @ X2239|ord_less_eq_set_val @ X2238 @ X2239))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])])).
0.22/0.54	thf(c_0_6, plain, ![X2:val]:(member_val @ X2 @ p|~member_val @ X2 @ scc), inference(split_conjunct,[status(thm)],[c_0_4])).
0.22/0.54	thf(c_0_7, plain, ![X9:set_val, X17:set_val]:(member_val @ (esk50_2 @ X9 @ X17) @ X9|ord_less_eq_set_val @ X9 @ X17), inference(split_conjunct,[status(thm)],[c_0_5])).
0.22/0.54	thf(c_0_8, negated_conjecture, ~ord_less_eq_set_val @ scc @ p, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
0.22/0.54	thf(c_0_9, plain, ![X9:set_val, X17:set_val]:(ord_less_eq_set_val @ X9 @ X17|~member_val @ (esk50_2 @ X9 @ X17) @ X17), inference(split_conjunct,[status(thm)],[c_0_5])).
0.22/0.54	thf(c_0_10, plain, ![X9:set_val]:(member_val @ (esk50_2 @ scc @ X9) @ p|ord_less_eq_set_val @ scc @ X9), inference(spm,[status(thm)],[c_0_6, c_0_7])).
0.22/0.54	thf(c_0_11, negated_conjecture, ~ord_less_eq_set_val @ scc @ p, inference(split_conjunct,[status(thm)],[c_0_8])).
0.22/0.54	thf(c_0_12, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11]), ['proof']).
0.22/0.54	# SZS output end CNFRefutation
0.22/0.54	# Proof object total steps             : 13
0.22/0.54	# Proof object clause steps            : 6
0.22/0.54	# Proof object formula steps           : 7
0.22/0.54	# Proof object conjectures             : 3
0.22/0.54	# Proof object clause conjectures      : 1
0.22/0.54	# Proof object formula conjectures     : 2
0.22/0.54	# Proof object initial clauses used    : 4
0.22/0.54	# Proof object initial formulas used   : 3
0.22/0.54	# Proof object generating inferences   : 2
0.22/0.54	# Proof object simplifying inferences  : 1
0.22/0.54	# Training examples: 0 positive, 0 negative
0.22/0.54	# Parsed axioms                        : 437
0.22/0.54	# Removed by relevancy pruning/SinE    : 0
0.22/0.54	# Initial clauses                      : 943
0.22/0.54	# Removed in clause preprocessing      : 159
0.22/0.54	# Initial clauses in saturation        : 784
0.22/0.54	# Processed clauses                    : 1113
0.22/0.54	# ...of these trivial                  : 26
0.22/0.54	# ...subsumed                          : 274
0.22/0.54	# ...remaining for further processing  : 813
0.22/0.54	# Other redundant clauses eliminated   : 90
0.22/0.54	# Clauses deleted for lack of memory   : 0
0.22/0.54	# Backward-subsumed                    : 1
0.22/0.54	# Backward-rewritten                   : 2
0.22/0.54	# Generated clauses                    : 608
0.22/0.54	# ...of the previous two non-trivial   : 441
0.22/0.54	# Contextual simplify-reflections      : 10
0.22/0.54	# Paramodulations                      : 500
0.22/0.54	# Factorizations                       : 2
0.22/0.54	# NegExts                              : 1
0.22/0.54	# Equation resolutions                 : 90
0.22/0.54	# Propositional unsat checks           : 0
0.22/0.54	#    Propositional check models        : 0
0.22/0.54	#    Propositional check unsatisfiable : 0
0.22/0.54	#    Propositional clauses             : 0
0.22/0.54	#    Propositional clauses after purity: 0
0.22/0.54	#    Propositional unsat core size     : 0
0.22/0.54	#    Propositional preprocessing time  : 0.000
0.22/0.54	#    Propositional encoding time       : 0.000
0.22/0.54	#    Propositional solver time         : 0.000
0.22/0.54	#    Success case prop preproc time    : 0.000
0.22/0.54	#    Success case prop encoding time   : 0.000
0.22/0.54	#    Success case prop solver time     : 0.000
0.22/0.54	# Current number of processed clauses  : 244
0.22/0.54	#    Positive orientable unit clauses  : 46
0.22/0.54	#    Positive unorientable unit clauses: 0
0.22/0.54	#    Negative unit clauses             : 2
0.22/0.54	#    Non-unit-clauses                  : 196
0.22/0.54	# Current number of unprocessed clauses: 583
0.22/0.54	# ...number of literals in the above   : 1522
0.22/0.54	# Current number of archived formulas  : 0
0.22/0.54	# Current number of archived clauses   : 479
0.22/0.54	# Clause-clause subsumption calls (NU) : 52424
0.22/0.54	# Rec. Clause-clause subsumption calls : 38158
0.22/0.54	# Non-unit clause-clause subsumptions  : 281
0.22/0.54	# Unit Clause-clause subsumption calls : 692
0.22/0.54	# Rewrite failures with RHS unbound    : 0
0.22/0.54	# BW rewrite match attempts            : 40
0.22/0.54	# BW rewrite match successes           : 1
0.22/0.54	# Condensation attempts                : 0
0.22/0.54	# Condensation successes               : 0
0.22/0.54	# Termbank termtop insertions          : 82008
0.22/0.54	
0.22/0.54	# -------------------------------------------------
0.22/0.54	# User time                : 0.159 s
0.22/0.54	# System time              : 0.007 s
0.22/0.54	# Total time               : 0.166 s
0.22/0.54	# Maximum resident set size: 2756 pages
0.22/0.54	EOF